Lossy Compression With Universal Distortion

We consider a novel variant of $d$ -semifaithful lossy coding in which the distortion measure is revealed only to encoder and at run-time, as well an extension it constraint also run-time. Two forms rate redundancy are used analyze performance, achievability results both pointwise minimax nature demonstrated. The first scheme uses ideas from VC dimension growth functions, second appropriate quantization space measures, third relies on random argument.